Synthesising and Implementing Tableau Calculi for Interrogative Epistemic Logics
نویسندگان
چکیده
This paper presents a labelled tableau approach for deciding interrogative-epistemic logics (IEL). Tableau calculi for these logics have been derived using a recently introduced tableau synthesis method. We also consider an extension of the framework for a setting with questioning modalities over sequences of formulae called sequential questioning logic (SQL). We have implemented the calculi using two approaches. The first implementation has been obtained with the tableau prover generation software MetTeL2, while the other implementation is a prover implemented in Haskell.
منابع مشابه
Tableaux for Regular Grammar Logics of Agents Using Automaton-Modal Formulae
We present sound and complete tableau calculi for the class of regular grammar logics and a class eRG of extended regular grammar logics which contains useful epistemic logics for reasoning about beliefs of agents. Our tableau rules use a special feature called automaton-modal formulae which are similar to formulae of automaton propositional dynamic logic. Our calculi are cut-free and have the ...
متن کاملClausal Tableaux for Multimodal Logics of Belief
We develop clausal tableau calculi for seven multimodal logics variously designed for reasoning about multi-degree belief, reasoning about distributed systems of belief and for reasoning about epistemic states of agents in multi-agent systems. Our tableau calculi are sound, complete, cut-free and have the analytic superformula property, thereby giving decision procedures for all of these logics...
متن کاملTerminating Tableaux for Dynamic Epistemic Logics
Throughout the last decade, there has been an increased interest in various forms of dynamic epistemic logics to model the flow of information and the effect this flow has on knowledge in multi-agent systems. This enterprise, however, has mostly been applicationally and semantically driven. This results in a limited amount of proof theory for dynamic epistemic logics. In this paper, we try to c...
متن کاملTableau Calculi for KLM Logics: extended version
We present tableau calculi for some logics of nonmonotonic reasoning, as defined by Kraus, Lehmann and Magidor. We give a tableau proof procedure for all KLM logics, namely preferential, loop-cumulative, cumulative and rational logics. Our calculi are obtained by introducing suitable modalities to interpret conditional assertions. We provide a decision procedure for the logics considered, and w...
متن کاملTableau Calculi for the Logics of Finite k-Ary Trees
We present tableau calculi for the logics Dk (k ≥ 2) semantically characterized by the classes of Kripke models built on finite k-ary trees. Our tableau calculi use the signs T and F, some tableau rules for Intuitionistic Logic and two rules formulated in a hypertableau fashion. We prove the Soundness and Completeness Theorems for our calculi. Finally, we use them to prove the main properties o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012